Tensor analysis with n-mode generalized difference subspace
نویسندگان
چکیده
The increasing use of multiple sensors, which produce a large amount multi-dimensional data, requires efficient representation and classification methods. In this paper, we present new method for data that relies on two premises: (1) are usually represented by tensors, since brings benefits from multilinear algebra established tensor factorization methods; (2) can be described subspace vector space. has been employed pattern-set recognition, its counterpart is also available in the literature. However, traditional methods do not discriminative information degrading accuracy. case, generalized difference (GDS) provides an enhanced reducing redundancy revealing structures. Since GDS does handle propose projection called n-mode GDS, efficiently handles data. We introduce Fisher score as class separability index improved metric based geodesic distance similarity. experimental results gesture action recognition show proposed outperforms commonly used literature without relying pre-trained models or transfer learning.
منابع مشابه
Tensor Subspace Analysis
Previous work has demonstrated that the image variations of many objects (human faces in particular) under variable lighting can be effectively modeled by low dimensional linear spaces. The typical linear subspace learning algorithms include Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Locality Preserving Projection (LPP). All of these methods consider an n1 × n2 ...
متن کاملPrincipal Component Analysis with Tensor Train Subspace
Tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing large-scale multidimensional data via a set of network of low-rank tensors. Associated with such a construction is a notion of Tensor Train subspace and in this paper we propose a TTPCA algorithm for estimating this structured subspace from the given data. By maintaining lo...
متن کاملSubspace Learning Based on Tensor Analysis
Linear dimensionality reduction techniques have been widely used in pattern recognition and computer vision, such as face recognition, image retrieval, etc. The typical methods include Principal Component Analysis (PCA) which is unsupervised and Linear Discriminant Analysis (LDA) which is supervised. Both of them consider an m1 × m2 image as a high dimensional vector in Rm1×m2 . Such a vector r...
متن کاملBest subspace tensor approximations
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank k approximations. For t-tensors with t > 2 many generalizations of the singular val...
متن کاملTensor Matched Subspace Detection
The problem of testing whether an incomplete tensor lies in a given tensor subspace is significant when it is impossible to observe all entries of a tensor. We focus on this problem under tubal-sampling and elementwise-sampling. Different from the matrix case, our problem is much more challenging due to the curse of dimensionality and different definitions for tensor operators. In this paper, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems With Applications
سال: 2021
ISSN: ['1873-6793', '0957-4174']
DOI: https://doi.org/10.1016/j.eswa.2020.114559